Fully Anonymous Identity-based Broadcast Encryption without Random Oracles

نویسندگان

  • Yanli Ren
  • Zhihua Niu
  • Xinpeng Zhang
چکیده

In a broadcast encryption (BE) scheme, a broadcaster can encrypt a message for a set S of users who are listening to a broadcast channel. Most identity-based broadcast encryption (IBBE) schemes are not anonymous, which means the attacker can obtain the identities of all receivers from the ciphertext. Currently, anonymous IBBE schemes are only provably secure in the random oracle model. In this paper, we propose a fully anonymous IBBE scheme based on asymmetric bilinear groups, which is adaptive-ID secure without random oracles. Any attacker cannot get the identities of the receivers from the ciphertext, and each receiver is anonymous for any other receiver, and only the broadcaster knows the identities of all receivers. The scheme can simultaneously realize semantic security and recipient anonymity.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Practical Identity-Based Encryption Without Random Oracles

We present an Identity Based Encryption (IBE) system that is fully secure in the standard model and has several advantages over previous such systems – namely, computational efficiency, shorter public parameters, and a “tight” security reduction, albeit to a stronger assumption that depends on the number of private key generation queries made by the adversary. Our assumption is a variant of Bon...

متن کامل

Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)

We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the mild Decision Linear complexity assumption in bilinear groups. The system is efficient and practical, with small ciphertexts of size linear in the depth of the hierarchy. Applications include search on encrypted data...

متن کامل

Efficient Identity-based Broadcast Encryption without Random Oracles

We propose a new efficient identity-based broadcast encryption scheme without random oracles and prove that it achieves selective identity, chosen plaintext security. Our scheme is constructed based on bilinear Diffie-Hellman inversion assumption and it is a good efficient hybrid encryption scheme, which achieves O(1)-size ciphertexts, public parameters and constant size private keys. In our sc...

متن کامل

Identity-Based Revocation from Subset Difference Methods under Simple Assumptions

Identity-based revocation (IBR) is a specific kind of broadcast encryption that can effectively send a ciphertext to a set of receivers. In IBR, a ciphertext is associated with a set of revoked users instead of a set of receivers and the maximum number of users in the system can be an exponential value in the security parameter. In this paper, we reconsider the general method of Lee, Koo, Lee, ...

متن کامل

Identity-Based Encryption from Lattices in the Standard Model

We construct an Identity-Based Encryption (IBE) system without random oracles from hard problems on random integer lattices. The system is anonymous, with pseudo-random ciphertexts.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • I. J. Network Security

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2014